Index support for content%2Dbased multimedia exploration.

Adaptive outlierness for subspace outlier ranking.

Signature Quadratic Form Distance.

Speeding Up Complex Video Copy Detection Queries.

Air%2DIndexing on Error Prone Communication Channels.

Air%2DIndexing on Error Prone Communication Channels.

SOREX Subspace Outlier Ranking Exploration Toolkit.

Pattern detector fast detection of suspicious stream patterns for immediate reaction.

Efficient k%2Dnearest neighbor queries with the Signature Quadratic Form Distance.

A comparative study of similarity measures for content%2Dbased multimedia retrieval.

Visual speaker model exploration.

Visual speaker model exploration.

Improving the Efficiency of Content%2DBased Multimedia Exploration.

Subgraph Mining on Directed and Weighted Graphs.

Bulk Loading Hierarchical Mixture Models for Efficient Stream Classification.

Subspace Clustering for Uncertain Data.

Similarity matrix compression for efficient signature quadratic form distance computation.

MC%2DTree Improving Bayesian Anytime Classification.

CoDA Interactive Cluster Based Concept Discovery.
Large data resources are ubiquitous in science and business. For these domains, an intuitive view on the data is essential to fully exploit the hidden knowledge. Often, these data can be semantically structured by concepts. Since the determination of concepts requires a thorough analysis of the data, data mining methods have to be applied. In the field of subspace clustering, some techniques have recently shown to be effective for this task. Although these methods generate concept-based patterns, the user has to provide domain knowledge to gain reasonable concepts out of the data. Our demonstration CoDA (Concept Determination and Analysis) is a tool that supports the user in the final step of concept definition. More concretely, the user is guided through an iterative, interactive process in which concepts are suggested, analyzed, and potentially refined. The core aspect of CoDA is an intuitive, concept-driven presentation of subspace clusters such that concepts can be visually captured. 1.
Advances in Spatial and Temporal Databases
We present here a theory of motion from a topological point of view, in a symbolic perspective. Taking space-time histories of objects as primitive entities, we introduce temporal and topological relations on the thus defined space-time to characterize classes of spatial changes. The theory thus accounts for qualitative spatial information, dealing with underspecified, symbolic information when accurate data is not available or unnecessary. We show that these structures give a basis for commonsense spatio-temporal reasoning by presenting a number of significant deductions in the theory. This can serve as a formal basis for languages describing motion events in a qualitative way.
Signature quadratic form distances for content%2Dbased similarity.

High%2DDimensional Indexing for Multimedia Features.

Metrische Anpassung der Earth Mover%27s Distanz zur %C4hnlichkeitssuche in Multimedia%2DDatenbanken.

Detection of orthogonal concepts in subspaces of high dimensional data.

Exploring multimedia databases via optimization%2Dbased relevance feedback and the earth mover%27s distance.

Harnessing the Strengths of Anytime Algorithms for Constant Data Streams.

Indexing density models for incremental learning and anytime classification on data streams.

Indexing density models for incremental learning and anytime classification on data streams.

Type%2Dbased categorization of relational attributes.
In this work we concentrate on categorization of relational attributes based on their data type. Assuming that attribute type/characteristics are unknown or unidentifiable, we analyze and compare a variety of type-based signatures for classifying the attributes based on the semantic type of the data contained therein (e.g., router identifiers, social security numbers, email addresses). The signatures can subsequently be used for other applications as well, like clustering and index optimization/compression. This application is useful in cases where very large data collections that are generated in a distributed, ungoverned fashion end up having unknown, incomplete, inconsistent or very complex schemata and schema level meta-data. We concentrate on heuristically generating type-based attribute signatures based on both local and global computation approaches. We show experimentally that by decomposing data into q-grams and then considering signatures based on q-gram distributions, we achieve very good classification accuracy under the assumption that a large sample of the data is available for building the signatures. Then, we turn our attention to cases where a very small sample of the data is available, and hence accurately capturing the q-gram distribution of a given data type is almost impossible. We propose techniques based on dimensionality reduction and soft-clustering that exploit correlations between attributes to improve classification accuracy. 1.
Self%2DAdaptive Anytime Stream Clustering.


Relevant Subspace Clustering Mining the Most Interesting Non%2Dredundant Concepts in High Dimensional Data.


DensEst Density Estimation for Data Mining in High Dimensional Spaces.

HSM Heterogeneous Subspace Mining in High Dimensional Data.

Nearest Neighbor Classification.
Nearest neighbor classification expects the class conditional probabilities to be locally constant, and suffers from bias in high dimensions. We propose a locally adaptive form of nearest neighbor classification to try to ameliorate this curse of dimensionality. We use a local linear discriminant analysis to estimate an effective metric for computing neighborhoods. We determine the local decision boundaries from centroid information, and then shrink neighborhoods in directions orthogonal to these local decision boundaries, and elongate them parallel to the boundaries. Thereafter, any neighborhood-based classifier can be employed, using the modified neighborhoods. The posterior probabilities tend to be more homogeneous in the modified neighborhoods. We also propose a method for global dimension reduction, that combines local dimension information. In a number of examples, the methods demonstrate the potential for substantial improvements over nearest neighbor classification.  Keywords--...
Harnessing the strengths of anytime algorithms for constant data streams.

Evaluating Clustering in Subspace Projections of High Dimensional Data.
Clustering high dimensional data is an emerging research field. Subspace clustering or projected clustering group similar objects in subspaces, i.e. projections, of the full space. In the past decade, several clustering paradigms have been developed in parallel, without thorough evaluation and comparison between these paradigms on a common basis. Conclusive evaluation and comparison is challenged by three major issues. First, there is no ground truth that describes the “true ” clusters in real world data. Second, a large variety of evaluation measures have been used that reflect different aspects of the clustering result. Finally, in typical publications authors have limited their analysis to their favored paradigm only, while paying other paradigms little or no attention. In this paper, we take a systematic approach to evaluate the major paradigms in a common framework. We study representative clustering algorithms to characterize the different aspects of each paradigm and give a detailed comparison of their properties. We provide a benchmark set of results on a large variety of real world and synthetic data sets. Using different evaluation measures, we broaden the scope of the experimental analysis and create a common baseline for future developments and comparable evaluations in the field. For repeatability, all implementations, data sets and evaluation measures are available on our website 1. 1.


EDSC efficient density%2Dbased subspace clustering.

Pleiades Subspace Clustering and Evaluation.

The TS%2Dtree efficient time series search and retrieval.

Efficient similarity search using the Earth Mover%27s Distance for large multimedia databases.

Ranking multimedia databases via relevance feedback with history and foresight support.

OutRank ranking outliers in high dimensional data.

INSCY Indexing Subspace Clusters with In%2DProcess%2DRemoval of Redundancy.

Morpheus interactive exploration of subspace clustering.

Mobile Mining and Information Management in HealthNet Scenarios.
Abstract—Health and mobility of elderly people is gaining importance in aging societies. New communication-based methods to provide health services with personal health care devices are considered promising elements of first-class medical care services for everybody. To achieve this vision, several technological issues have to be solved: (i) body sensors to monitor vital functions have to be developed; (ii) these sensors should be integrated into textile structures to guarantee ease of use and patient acceptance; (iii) the collected sensor data has to be analyzed to detect emergency situations and to reduce the data volume; (iv) relevant data has to be integrated with other information systems in the work environment of medical experts. These challenges are addressed within the HealthNet project at RWTH Aachen University. The goal of the project is to develop a framework in which health professionals can remotely monitor and diagnose mobile patients. The described demonstration presents our results of the first three issues mentioned above while focussing on the employed data mining and management techniques. I.

SubClass Classification of Multidimensional Noisy Data Using Subspace Clusters.

Efficient EMD%2Dbased similarity search in multimedia databases via flexible dimensionality reduction.


Bin%E4re Suche.

Public microarray repository semantic annotation with ontologies employing text mining and expression profile correlation.

Extended Query Refinement for Medical Image Retrieval.
The impact of image pattern recognition on accessing large databases of medical images has recently been explored, and content-based image retrieval (CBIR) in medical applications (IRMA) is researched. At the present, however, the impact of image retrieval on diagnosis is limited, and practical applications are scarce. One reason is the lack of suitable mechanisms for query refinement, in particular, the ability to (1) restore previous session states, (2) combine individual queries by Boolean operators, and (3) provide continuous-valued query refinement. This paper presents a powerful user interface for CBIR that provides all three mechanisms for extended query refinement. The various mechanisms of manYmachine interaction during a retrieval session are grouped into four classes: (1) output modules, (2) parameter modules, (3) transaction modules, and (4) process modules, all of which are controlled by a detailed query logging. The query logging is linked to a relational database. Nested loops for interaction provide a maximum of flexibility within a minimum of complexity, as the entire data flow is still controlled within a single Web page. Our approach is implemented to support various modalities, orientations, and body regions using global features that model gray scale, texture, structure, and global shape characteristics. The resulting extended query refinement has a significant impact for medical CBIR applications. KEY WORDS: Graphical user interface (GUI), web-based interface, query refinement, relevance feedback, usability
Clustering multidimensional sequences in spatial and temporal databases.
and temporal databases
Clustering multidimensional sequences in spatial and temporal databases.
and temporal databases
Datenbanksysteme in Business
Abstract. The development of composite Web services is still not as simple as the original vision indicated. Currently, the designer of a composite service needs to consider many different design aspects at once. In this paper, we propose a modeling methodology based on UML which separates between the four concerns of structure, transactions, workflow, and security, each of which can be modeled by different experts. We have developed a proof-of-concept tool that is able to extract information from the model and transform it into a computer-readable format. 1
Datenbanksysteme in Business
Abstract. The development of composite Web services is still not as simple as the original vision indicated. Currently, the designer of a composite service needs to consider many different design aspects at once. In this paper, we propose a modeling methodology based on UML which separates between the four concerns of structure, transactions, workflow, and security, each of which can be modeled by different experts. We have developed a proof-of-concept tool that is able to extract information from the model and transform it into a computer-readable format. 1
AttentionAttractor efficient video stream similarity query processing in real time.

DUSC Dimensionality Unbiased Subspace Clustering.

Subspace outlier mining in large multimedia databases.

Efficient Index Support for View%2DDependent Queries on CFD Data.

IndeGS Index Supported Graphics Data Server for CFD Data Postprocessing.

Clicks An effective algorithm for mining subspace clusters in categorical datasets.
We present a novel algorithm called Clicks, that finds clusters in categorical datasets based on a search for k-partite maximal cliques. Unlike previous methods,    mines subspace clusters. It uses a selective vertical method to guarantee complete search. Clicks outperforms previous approaches by over an order of magnitude and scales better than any of the existing method for high-dimensional datasets. These results are demonstrated in a comprehensive performance study on real and synthetic datasets.

VISA visual subspace clustering analysis.

Efficient multi%2Dstep query processing for EMD%2Dbased similarity.

Approximation Techniques to Enable Dimensionality Reduction for Voronoi%2DBased Nearest Neighbor Search.


Spatial Multidimensional Sequence Clustering.

Adaptable Distance Functions for Similarity%2Dbased Multimedia Retrieval.

Integrating the Relational Interval Tree into IBM%27s DB2 Universal Database Server.

CLICKS an effective algorithm for mining subspace clusters in categorical datasets.
We present a novel algorithm called Clicks, that finds clusters in categorical datasets based on a search for k-partite maximal cliques. Unlike previous methods,    mines subspace clusters. It uses a selective vertical method to guarantee complete search. Clicks outperforms previous approaches by over an order of magnitude and scales better than any of the existing method for high-dimensional datasets. These results are demonstrated in a comprehensive performance study on real and synthetic datasets.
Efficiently Processing Queries on Interval%2Dand%2DValue Tuples in Relational Databases.
With the increasing occurrence of temporal and spatial data in present-day database applications, the interval data type is adopted by more and more database systems. For an efficient support of queries that contain selections on interval attributes as well as simple-valued attributes (e. g. numbers, strings) at the same time, special index structures are required supporting both types of predicates in combination. Based on the Relational Interval Tree, we present various indexing schemes that support such combined queries and can be integrated in relational database systems with minimum effort. Experiments on different query types show superior performance for the new techniques in comparison to competing access methods. 1.
Object%2DRelational Spatial Indexing.
Abstract. Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational database systems. Furthermore, there exist effective and efficient models to estimate the selectivity and the I/O cost in order to guide the cost-based optimizer whether and how to include these index structures into the execution plan. By design, the models immediately fit to common extensible indexing/optimization frameworks, and their implementations exploit the built-in statistics facilities of the database server. In this paper, we show how these statistics can also be used for accelerating the access methods themselves by reducing the number of generated join partners which results in fewer logical reads and consequently improves the overall runtime. We cut down on the number of join partners by grouping different join partners together according to a statistic driven grouping algorithm. Our experiments on an Oracle9i database yield an average speed-up between 20 % and 10,000 % for spatial collision queries on the Relational Interval Tree and on the Relational Quadtree.
Efficient interval management using object%2Drelational database servers.

Nearest Neighbor Search on Multimedia Indexing Structures.

CVDB 2004 Panel Future Applications and Solutions.

A Cost Model for Spatial Intersection Queries on RI%2DTrees.

Efficient Similarity Search for Hierarchical Data in Large Databases.
Structured and semi-structured object representations are getting more  and more important for modern database applications. Examples for such data are  hierarchical structures including chemical compounds, XML data or image data.
Efficient Similarity Search in Large Databases of Tree Structured Objects.

Joining Interval Data in Relational Databases.
The increasing use of temporal and spatial data in presentday relational systems necessitates an efficient support of joins on interval-valued attributes. Standard join algorithms do not support those data types adequately, whereas special approaches for interval joins usually require an augmentation of the internal access methods which is not supported by existing relational systems. To overcome these problems we introduce new join algorithms for interval data. Based on the Relational Interval Tree, these algorithms can easily be implemented on top of any relational database system while providing excellent performance on joining intervals. As experimental results on an Oracle9i server show, the new techniques outperform existing relational methods for joining intervals significantly. 1.
The Paradigm of Relational Indexing a Survey.
In order to achieve efficient execution plans for queries comprising userdefined  data types and predicates, the database system has to be provided with appropriate  index structures, query processing methods, and optimization rules. Although  available extensible indexing frameworks provide a gateway to seamlessly integrate  user-defined access methods into the standard process of query optimization and execution,  they do not facilitate the actual implementation of the access method itself. An  internal enhancement of the database kernel is usually not an option for database developers.
Spatial Data Management for Virtual Product Development.

Spatial Query Processing for High Resolutions.
Modern database applications including computeraided design (CAD), medical imaging, or molecular biology impose new requirements on spatial query processing. Particular problems arise from the need of high resolutions for very large spatial objects, including cars, space stations, planes and industrial plants, and from the design goal to use general purpose database management systems in order to guarantee industrial-strength. In the past two decades, various stand-alone spatial index structures have been proposed but their integration into fully-fledged database systems is problematic. Most of these approaches are based on decomposition of spatial objects leading to replicating index structures. In contrast to common black-and-white decompositions which suffer from the lack of intermediate solutions, we introduce grey approximations as a new and general concept. We demonstrate the benefits of grey approximations in the context of encoding spatial objects by space filling curves resulting in grey interval sequences. Spatial intersection queries are then processed by a filter and refine architecture which, as an important design goal, can purely be expressed by means of the SQL:1999 standard. Our new High Resolution Indexing (HRI) method can easily be integrated into general purpose DBMSs. The experimental evaluation on real-world test data from car and plane design projects points out that our new concept outperforms competitive techniques that are implementable on top of a standard object -relational DBMS by an order of magnitude with respect to secondary storage space and overall query response time. 1. 
Effective Similarity Search on Voxelized CAD Object.
Similarity search in database systems is becoming an increasingly important task in modern application domains such as multimedia, molecular biology, medical imaging and many others. Especially for CAD applications, suitable similarity models and a clear representation of the results can help to reduce the cost of developing and producing new parts by maximizing the reuse of existing parts. In this paper, we adapt two known similarity models to voxelized 3-D CAD data and introduce a new model based on eigenvectors. The experimental evaluation of our three similarity models is based on two real-world test datasets. Furthermore, we introduce hierarchical clustering as a new and effective way to analyse and compare similarity models. We show that both our similarity model as well as our evaluation procedure are suitable for industrial use.
A Cost Model for Interval Intersection Queries on RI%2DTrees.
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree    ), an efficient access method has been proposed to process interval intersection queries on top of existing objectrelational database systems. This paper complements that approach by effective and efficient models to estimate the selectivity and the I/O cost of interval intersection queries in order to guide the cost-based optimizer whether and how to include the RI-tree into the execution plan. By design, the models immediately fit to common extensible indexing/ optimization frameworks, and their implementations exploit the built-in statistics facilities of the database server. According to our experimental evaluation on an Oracle database, the average relative error of the estimated cost to the actual cost of index scans ranges from 0% to 23%, depending on the resolution of the persistent statistics and the size of the query objects.
Combining Approximation Techniques and Vector Quantization for Adaptable Similarity Search.

Adaptable Similarity Search Using Vector Quantization.
Adaptable similarity queries based on quadratic form distance  functions are widely popular in data mining applications, particularly for domains  such as multimedia, CAD, molecular biology or medical image databases.
DIVE Database Integration for Virtual Engineering.
This demonstration presents a spatial database integration for novel CAD applications as digital mockup or haptic rendering. The spatial data management and query processor is fully embedded into the Oracle8i server and has been evaluated in an industrial environment. Spatial queries on large databases are performed at interactive response times.  1 
Spatial Data Management for Computer Aided Design.

Interval Sequences An Object%2DRelational Approach to Manage Spatial Data.
. The design of external index structures for one- and multidimensional  extended objects is a long and well studied subject in basic database research.  Today, more and more commercial applications rely on spatial datatypes and  require a robust and seamless integration of appropriate access methods into  reliable database servers. This paper proposes an efficient, dynamic and scalable  approach to manage one-dimensional interval sequences within off-the-shelf  object-relational database systems. The presented technique perfectly fits to the  concept of space-filling curves and, thus, generalizes to spatially extended objects  in multidimensional data spaces. Based on the Relational Interval Tree, the method  is easily embedded in modern extensible indexing frameworks and significantly  outmatches Linear Quadtrees and Relational R-trees with respect to usability,  concurrency, and performance. As demonstrated by our experimental evaluation on  an Oracle server with real GIS and CAD data, the competing methods are  outperformed by factors of up to 4.6 (Linear Quadtree) and 58.3 (Relational R-tree)  for query response time.  1 
Object%2DRelational Indexing for General Interval Relationships.
. Intervals represent a fundamental data type for temporal, scientific, and  spatial databases where time stamps and point data are extended to time spans and  range data, respectively. For OLTP and OLAP applications on large amounts of  data, not only intersection queries have to be processed efficiently but also general  interval relationships including before, meets, overlaps, starts, finishes, contains,  equals, during, startedBy, finishedBy, overlappedBy, metBy, and after. Our new  algorithms use the Relational Interval Tree, a purely SQL-based and objectrelationally  wrapped index structure. The technique therefore preserves the  industrial strength of the underlying RDBMS including stability, transactions, and  performance. The efficiency of our approach is demonstrated by an experimental  evaluation on a real weblog data set containing one million sessions.  1 
Managing Intervals Efficiently in Object%2DRelational Databases.
Modern database applications show a growing demand  for efficient and dynamic management of intervals,  particularly for temporal and spatial data  or for constraint handling. Common approaches  require the augmentation of index structures  which, however, is not supported by existing relational  database systems. By design, the new Relational  Interval Tree (RI-tree) employs built-in  indexes on an as-they-are basis and is easy to implement. Whereas
Indexing the Solution Space A New Technique for Nearest Neighbor Search in High%2DDimensional Space.

Nearest Neighbor Classification in 3D Protein Databases.
In molecular databases, structural classification is a basic task  that can be successfully approached by nearest neighbor  methods. The underlying similarity models consider spatial  properties such as shape and extension as well as thematic  attributes. We introduce 3D shape histograms as an intuitive  and powerful approach to model similarity for solid objects  such as molecules. Errors of measurement, sampling, and numerical  rounding may result in small displacements of atomic  coordinates. These effects may be handled by using quadratic  form distance functions. An efficient processing of similarity  queries based on quadratic forms is supported by a filter-refinement  architecture. Experiments on our 3D protein database  demonstrate the high classification accuracy of more  than 90% and the good performance of the technique.  Keywords: 3D Protein Databases, Nearest Neighbor Classification,  Geometric Similarity Search, Machine Learning  1 Introduction  One important task for mod...
3D Shape Histograms for Similarity Search and Classification in Spatial Databases.
 Classification is one of the basic tasks of data mining in modern database applications including molecular biology, astronomy, mechanical engineering, medical imaging or meteorology. The underlying models have to consider spatial properties such as shape or extension as well as thematic attributes. We introduce 3D shape histograms as an intuitive and powerful similarity model for 3D objects. Particular flexibility is provided by using quadratic form distance functions in order to account for errors of measurement, sampling, and numerical rounding that all may result in small displacements and rotations of shapes. For query processing, a general filter-refinement architecture is employed that efficiently supports similarity search based on quadratic forms. An experimental evaluation in the context of molecular biology demonstrates both, the high classification accuracy of more than 90 % and the good performance of the approach.
Adaptable Similarity Search in Large Image Databases.
Similarity has highly application dependent and even subjective characteristics. Similarity models therefore have to be adaptable to application specific requirements and individual user preferences. We focus on two aspects of adaptable similarity search: (1) Adaptable Similarity Models. Examples include pixelbased shape similarity as well as 2D and 3D shape histograms, applied to biomolecular and image databases. (2) Efficient Similarity Query Processing. Similarity models based on quadratic forms result in ellipsoid queries on highdimensional data spaces. We present algorithms to efficiently process ellipsoid queries on index structures, and improve the performance by introducing various approximation techniques that guarantee no false dismissals for both similarity range queries and k-nearest neighbor queries.

Bioinformatik %2D Aktuelles Schlagwort.

Similarity Search in 3D Protein Databases.
Introduction  We introduce a new approach for similarity search in 3-D protein databases. By using histograms, we define adaptable similarity models that address the 3-D shape as well as chemical properties of proteins. Quadratic forms are employed as similarity distance functions for which efficient query processing algorithms are available [Sei 97]. Experimental examples illustrate the applicability of the method. 2 Shape Histograms of 3-D Objects  For a histogram-based similarity model, we have to decompose the 3-D space into appropriate cells. These cells were used as bins of the histograms. In our primary approach, we distinguish three techniques for the decomposition of the 3-D space. Figure 1 illustrates these models in a 2-D projection: . Shell Model: Decomposition into concentric shells around the center point.  . Sector Model: Decomposition into sectors that emerge from the center point of the model.  . Net-Shaped Mo
Fast Nearest Neighbor Search in High%2DDimensional Space.
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query processing. As recent theoretical results show, state of the art approaches to nearest-neighbor search are not efficient in higher dimensions. In our new approach, we therefore precompute the result of any nearest-neighbor search which corresponds to a computation of the voronoi cell of each data point. In a second step, we store the voronoi cells in an index structure efficient for high-dimensional data spaces. As a result, nearest neighbor search corresponds to a simple point query on the index structure. Although our technique is based on a precomputation of the solution space, it is dynamic, i.e. it supports insertions of new data points. An extensive experimental evaluation of our technique demonstrates the high efficiency for uniformly distributed as well as real data. We obtained a significant reduction of the...

Improving Adaptable Similarity Query Processing by Using Approximations.
Similarity search and content-based retrieval are  becoming more and more important for an increasing  number of applications including multimedia,  medical imaging, 3D molecular and CAD database  systems. As a general similarity model that is  particularly adaptable to user preferences and,  therefore, fits the subjective character of similarity,  quadratic form distance functions have been  successfully employed, e.g. for color histograms  as well as for 2D and 3D shape histograms. Although  efficient algorithms for processing adaptable  similarity queries using multidimensional  index structures are available, the quadratic nature  of the distance function strongly affects the CPU  time which in turn represents a high percentage of  the overall runtime. The basic idea of our approach  is to reduce the number of exact distance computations  by adapting conservative approximation  techniques to similarity range query processing  and, in addition, to extend the concepts to k-nearest  neighbor search. As part of a detailed analysis, we  show that our methods guarantee no false drops. Experiments
Adaptable Similarity Search in 3%2DD Spatial Database Systems %28Abstract%29.

Approximation%2DBased Similarity Search for 3%2DD Surface Segments.

A Multistep Approach for Shape Similarity Search in Image Databases.

3D Similarity Search by Shape Approximation.
This paper presents a new method for similarity retrieval of 3D surface segments  in spatial database systems as used in molecular biology, medical imaging, or  CAD. We propose a similarity criterion and algorithm for 3D surface segments which is  based on the approximation of segments by using multi-parametric functions. The  method can be adjusted to individual requirements of specific applications by choosing  appropriate surface functions as approximation models. For an efficient evaluation of  similarity queries, we developed a filter function which supports fast searching based on  spatial index structures and guarantees no false drops. The evaluation of the filter function  requires a new query type with multidimensional ellipsoids as query regions. We  present an algorithm to efficiently perform ellipsoid queries on the class of spatial index  structures that manage their directory by rectilinear hyperrectangles, such as R-trees or  X-trees. Our experiments show both, effectiveness as well as efficiency of our method  using a sample application from molecular biology.
Efficient User%2DAdaptable Similarity Search in Large Multimedia Databases.
Efficient user-adaptable similarity search more and more increases in its importance for multimedia and spatial database systems. As a general similarity model for multi-dimensional vectors that is adaptable to application requirements and user preferences, we use quadratic form distance functions which have been successfully applied to color histograms in image databases [Fal+ 94]. The components a ij of the matrix A denote similarity of the components i  and j of the vectors. Beyond the Euclidean distance which produces spherical query ranges, the similarity distance defines a new query type, the ellipsoid query. We present new algorithms to efficiently support ellipsoid query processing for various user-defined similarity matrices on existing precomputed indexes. By adapting techniques for reducing the dimensionality and employing a multi-step query processing architecture, the method is extended to high-dimensional data spaces. In particular, from our algorithm to reduce the simila...
Formbasierte Suche nach komplement%E4ren 3D%2DOberfl%E4chen in einer Protein%2DDatenbank.

Solvent Accessible Surface Representation in a Database System for Protein Docking.

A 3D Molecular Surface Representation Supporting Neighborhood Queries.
Abstract: Applications in molecular biology more and more require geometric data management along with physicochemical data handling. Thus, 3D structures and surfaces of molecules become basic objects in molecular databases. We propose the neighborhood query on graphs such as molecular surfaces as a fundamental query class concerning topological information on patch adjacency. Furthermore, we suggest a patch-based data structure, called the TriEdge structure, first, to efficiently support neighborhood query processing, and second, to save space in comparison to common 2D subdivision data structures such as the quad-edge structure or the doubly-connected edge list. In analogy to the quad-edge structure, the TriEdge structure has an algebraic interface and is implemented via complex pointers. However, we achieve a reduction of the space requirement by a factor of four. Finally, we investigate the time performance of our prototype which is based on an object-oriented database management system.
Supporting Data Mining of Large Databases by Visual Feedback Queries.

Visual Feedback in Querying Large Databases.

